Bounded-depth, polynomial-size circuits for symmetric functions
نویسندگان
چکیده
منابع مشابه
Bounded-Depth, Polynomial-Size Circuits for Symmetric Functions
Let ~:= {f~,f2 . . . . } be a family of symmetric Boolean functions, where fn has n Boolean variables, for each n I> 1. L e t / ~ ( n ) be the minimum number of variables offn that each have to be set to constant values so that the resulting function is a constant function. We show that the growth rate o f / ~ ( n ) completely determines whether or not the family ~: is 'good', that is, can be r...
متن کاملDefinability by Constant-Depth Polynomial-Size Circuits
A function of boolean arguments is symmetric if its value depends solely on the number of l 's among its arguments. In the first part of this paper we partially characterize those symmetric functions that can be computed by constant-depth polynomial-size sequences of boolean circuits, and discuss the complete characterization. (We treat both uniform and non-uniform sequences of circuits.) Our r...
متن کاملOptimal Depth, Very Small Size Circuits for Symmetric Functions in Ac
It is well-known which symmetric Boolean functions can be computed by constant depth, polynomial size, unbounded fan-in circuits, i.e. which are contained in the complexity class AC. This result is sharpened. Symmetric Boolean functions in AC can be computed by unbounded fan-in circuits with the following properties. If the optimal depth of ACcircuits is d, the depth is at most d + 2, the numbe...
متن کاملCommunication in Bounded Depth Circuits
We show that rigidity of matrices can be used to prove lower bounds on depth 2 circuits and communication graphs. We prove a general nonlinear lower bound on a certain type of circuits and thus, in particular, we determine the asymptotic size of depth d superconcentrators for all depths 4 (for even depths 4 it has been determined before).
متن کاملNon-malleable Codes for Bounded Depth, Bounded Fan-In Circuits
We show how to construct efficient, unconditionally secure non-malleable codes for bounded output locality. In particular, our scheme is resilient against functions such that any output bit is dependent on at most n bits, where n is the total number of bits in a codeword and 0 ≤ δ < 1 a constant. Notably, this tampering class includes NC .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1985
ISSN: 0304-3975
DOI: 10.1016/0304-3975(85)90045-3